Strategy Parallelism and Lemma Evaluation
نویسندگان
چکیده
Automated Deduction offers no unique strategy which is uniformly successful on all problems. Hence a parallel combination of several different strategies increases the chances of success. The efficiency of this approach can be increased even more by the exchange of suitable intermediate results. The paper offers a cooperative solution approach to this task. As a special kind of cooperation we present here the selection of suitable lemmata together with a model of a cooperative parallel theorem prover which combines different lemma selection techniques within a strategy parallel prover environment. We give a short assessment of the results of first experiments and an outline of the future work.
منابع مشابه
Paired ROBs: A Cost-Effective Reorder Buffer Sharing Strategy for SMT Processors
An important design issue of SMT processors is to find proper sharing strategies of resources among threads. This paper proposes a ROB sharing strategy, called paired ROB, that considers the fact that task parallelism is not always available to fully utilize resources of multithreaded processors. To this aim, an evaluation methodology is proposed and used for the experiments, which analyzes per...
متن کاملA Study of the Role of Repetition of Music in the Nimayee Poems of Akhavan Sales
In this article, the aim of the authors is to study the role of repetition in creating music and parallelism in Nimayee poems in the three collections of poems by Mehdi Akhavan Sales: Zamestan, Akhere Shahname and Az Avesta. Accordingly, the researchers have investigated the various manners of repetition in creating parallelism in the poems at three levels: phonological parallelism, lexical par...
متن کاملEvaluation Annotations for Hope+
To fully exploit the parallelism of the Flagship Machine it is desirable to be able to experiment with a variety of evaluation strategies. The ability to control the behaviour of individual functions via annotations is of enormous help in understanding the behaviour of a parallel system and permits the comparison of \lazy" and \eager" versions of languages as well as providing the oportunity to...
متن کاملAdhesive DPO Parallelism for Monic Matches
This paper presents indispensable technical results of a general theory that will allow to systematically derive from a given reduction system a behavioral congruence that respects concurrency. The theory is developed in the setting of adhesive categories and is based on the work by Ehrig and König on borrowed contexts; the latter are an instance of relative pushouts, which have been proposed b...
متن کاملLoad Bounding for Implicit Parallelism
It is well known that exploiting parallelism beyond the available machine parallelism can lead to vastly increased resource requirements. Programs which can run in linear space under a sequential execution regime may require exponential space in the context of unrestricted parallelism. In this paper we present an efficient adaptive software solution for the problem of avoiding excessive paralle...
متن کامل